Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs
نویسندگان
چکیده
منابع مشابه
Distance domination, guarding and vertex cover for maximal outerplanar graph
This paper discusses a distance guarding concept on triangulation graphs, which can be associated with distance domination and distance vertex cover. We show how these subjects are interconnected and provide tight bounds for any n-vertex maximal outerplanar graph: the 2d-guarding number, g2d(n) = ⌊ n 5 ⌋; the 2d-distance domination number, γ2d(n) = ⌊ n 5 ⌋; and the 2d-distance vertex cover numb...
متن کاملtotal $k$-distance domination critical graphs
a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.
متن کاملTOTAL k-DISTANCE DOMINATION CRITICAL GRAPHS
A set S of vertices in a graph G = (V,E) is called a total k-distance dominating set if every vertex in V is within distance k of a vertex in S. A graph G is total k-distance domination-critical if γ t (G − x) < γ t (G) for any vertex x ∈ V (G). In this paper, we investigate some results on total k-distance domination-critical of graphs.
متن کامل(k, +)-Distance-Hereditary Graphs
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networks with desirable connectivity properties; a network modeled as a (k, +)–distance-hereditary graph can be characterized as follows: if some nodes have failed, as long as two nodes remain connected, the distance between the...
متن کاملOn Minimum Maximal Distance-k Matchings
We study the computational complexity of several problems connected with the problems of finding a maximal distance-k matching of minimum cardinality or minimum weight. We introduce the class of k-equimatchable graphs which is an edge analogue of k-equipackable graphs. We prove that the recognition of k-equimatchable graphs is co-NP-complete for any fixed k ≥ 2. We provide a simple characteriza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.05.010